Collision Prediction: Conservative Advancement among Obstacles with Unknown Motion∗
نویسندگان
چکیده
Collision detection is a fundamental geometric tool for samplingbased motion planners. On the contrary, collision prediction for the scenarios that obstacle’s motion is unknown is still in its infancy. This paper proposes a new approach to predict collision by assuming that obstacles are adversarial. Our new tool advances collision prediction beyond the translational and disc robots; arbitrary polygons with rotation can be used to better represent obstacles and provide tighter bound on predicted collision time. Comparing to an online motion planner that replans periodically at fixed time interval, our experimental results provide strong evidences that our method significantly reduces the number of replannings while maintaining higher success rate of finding a valid path.
منابع مشابه
Conservative Collision Prediction Among Polygons with Unknown Motion
Collision detection is a fundamental geometric tool for sampling-based motion planners. On the contrary, collision prediction for the scenarios that obstacle’s motion is unknown is still in its infancy. This paper proposes a new approach to predict collision by assuming that obstacles are adversarial. Our new tool advances collision prediction beyond the translational and disc robots; arbitrary...
متن کاملCollision Prediction Among Rigid and Articulated Obstacles with Unknown Motion
Collision prediction is a fundamental operation for planning motion in dynamic environment. Existing methods usually exploit complex behavior models or use dynamic constraints in collision prediction. However, these methods all assume simple geometry, such as disc, which significantly limit their applicability. This paper proposes a new approach that advances collision prediction beyond disc ro...
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملC2A: Controlled conservative advancement for continuous collision detection of polygonal models
We present a simple and fast algorithm to perform continuous collision detection between polygonal models undergoing rigid motion for interactive applications. Our approach can handle all triangulated models and makes no assumption about the underlying geometry and topology. The algorithm uses the notion of conservative advancement (CA), originally developed for convex polytopes [1], [2]. We ex...
متن کاملOnline collision prediction among 2D polygonal and articulated obstacles
Collision prediction is a fundamental operation for planning motion in dynamic environment. Existing methods usually exploit complex behavior models or use dynamic constraints in collision prediction. However, these methods all assume simple geometry, such as disc, which significantly limit their applicability. This paper proposes a new approach that advances collision prediction beyond disc ro...
متن کامل